On the average condition number of tensor rank decompositions
نویسندگان
چکیده
منابع مشابه
The Condition Number of Join Decompositions∗
The join set of a finite collection of smooth embedded submanifolds of a mutual vector space is defined as their Minkowski sum. Join decompositions generalize some ubiquitous decompositions in multilinear algebra, namely tensor rank, Waring, partially symmetric rank and block term decompositions. This paper examines the numerical sensitivity of join decompositions to perturbations; specifically...
متن کاملOn the Optimization Landscape of Tensor Decompositions
Non-convex optimization with local search heuristics has been widely used in machine learning, achieving many state-of-art results. It becomes increasingly important to understand why they can work for these NP-hard problems on typical data. The landscape of many objective functions in learning has been conjectured to have the geometric property that “all local optima are (approximately) global...
متن کاملTensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
Machine learning and data mining algorithms are becoming increasingly important in analyzing large volume, multi-relational and multi– modal datasets, which are often conveniently represented as multiway arrays or tensors. It is therefore timely and valuable for the multidisciplinary research community to review tensor decompositions and tensor networks as emerging tools for large-scale data an...
متن کاملMinimizing the Condition Number for Small Rank Modifications
We consider the problem of minimizing the condition number of a low rank modification of a matrix. Analytical results show that the minimum, which is not necessarily unique, can be obtained and expressed by a small number of eigenpairs or singular pairs. The symmetric and the nonsymmetric cases are analyzed, and numerical experiments illustrate the analytical observations.
متن کاملOn the average rank of LYM-sets
Let S be a finite set with some rank function r such that the Whitney numbers w i = I { x e S I r ( x ) = i}l are log-concave. Given k, me N so that Wk-1 < Wk <~ Wk+m, set W = w k + w k + 1 + "'" + Wk + ~" Generalizing a theorem of Kleitman and Milner, we prove that every F ~ S with cardinality IFI/> Whas average rank at least ( k w k + ... + (k + m)wk+m)/W, provided the normalized profile vect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IMA Journal of Numerical Analysis
سال: 2019
ISSN: 0272-4979,1464-3642
DOI: 10.1093/imanum/drz026